Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks

نویسندگان

  • Tove Gustavi
  • Dimos V. Dimarogonas
  • Magnus Egerstedt
  • Xiaoming Hu
چکیده

In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication topology. In the scenario we consider, only the leaders are aware of the global mission, which is to converge to a known destination point. Thus, the followers need to stay in contact with the group of leaders in order to reach the goal. In the paper we show that we can maintain the initial network structure, and thereby connectivity, by setting up bounds on the ratio of leaders-to-followers and on the magnitude of the goal attraction force experienced by the leaders. The results are first established for an initially complete communication graph and then extended to an incomplete graph. The results are illustrated by computer simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Agent System Rendezvous via Refined Social System and Individual Roles

* This work is partially supported by NSFC Grant #61340041 and 61374079 and The Project-sponsored by SRF for ROCS, SEM to Yunzhong Song. Abstract: In order to explore the rendezvous problems of leader-follower multi-agent system further, three different kinds of strategies, namely the democracy strategy, the autarchy strategy as well as the mixed strategy, which were inspired by the mankind sys...

متن کامل

A General Framework for Consenses Networks

A novel approach for the study of the long-term behavior of solutions of continuous time consensus networks is developed. We establish sufficient conditions for convergence to a common equilibrium, under the mildest possible connectivity conditions, with emphasis on explicit estimates on the rate of convergence. The discussion ranges from linear to non-linear, decentralized to leader-follower a...

متن کامل

A decentralized multi-level leader-follower game for network design of a competitive supply chain

This paper develops a decentralized leader-follower game for network design of a competitive supply chain problem in which a new chain as the leader enters a market with one existing supply chain as a follower. Both chains produce an identical product, customer demand is inelastic and customer utility function is based on Huff gravity-based model. The leader wants to shape his network and set a...

متن کامل

Rendezvous of Mobile Agents without Agreement on Local Orientation

The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions. A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem. To allow deterministic exploration, it is usually assumed that the edges incident to a node are locally ordered according to a fixed function calle...

متن کامل

Community Detection in Networks: The Leader-Follower Algorithm

Traditional spectral clustering methods cannot naturally learn the number of communities in a network and often fail to detect smaller community structure in dense networks because they are based upon external community connectivity properties such as graph cuts. We propose an algorithm for detecting community structure in networks called the leader-follower algorithm which is based upon the na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2010